Proving Behavioural Theorems with Standard First-Order Logic
نویسندگان
چکیده
Behavioural logic is a generalization of first-order logic where the equality predicate is interpreted by a behavioural equality of objects (and not by their identity). We establish simple and general sufficient conditions under which the behavioural validity of some first-order formula with respect to a given first-order specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequence any proof system for first-order logic can be used to prove the behavioural validity of first-order formulas.
منابع مشابه
On Sets, Types, Fixed Points, and Checkerboards
Most current research on automated theorem proving is concerned with proving theorems of first-order logic. We discuss two examples which illustrate the advantages of using higher-order logic in certain contexts. For some purposes type theory is a much more convenient vehicle for formalizing mathematics than axiomatic set theory. Even theorems of first-order logic can sometimes be proven more e...
متن کاملSOUND AND COMPLETE TRANSLATIONSFROM SORTED HIGHER - ORDER LOGICINTO SORTED FIRST - ORDER LOGICManfred
Extending existing calculi by sorts is a strong means for improving the deductive power of rst-order theorem provers. Since many mathematical facts can be more easily expressed in higher-order logic { aside the greater power of higher-order logic in principle {, it is desirable to transfer the advantages of sorts in the rst-order case to the higher-order case. One possible method for automating...
متن کاملBehavioural Theories and The Proof of Behavioural
Behavioural theories are a generalization of rst-order theories where the equality predicate symbol is interpreted by a behavioural equality of objects (and not by their identity). In this paper we rst consider arbitrary behavioural equalities determined by some (partial) congruence relation and we show how to reduce the behavioural theory of any class of-algebras to (a subset of) the standard ...
متن کاملFirst-order resolution for CTL
In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical first-order resolution techniques. Since there already exist a lot of welldeveloped first-order logic theorem provers, reusing those techniques provides great benefit for solving other similar problems. We do not attempt to prove CTL theorems directly within the temporal logic sy...
متن کاملA Proof Repository for Formal Verification of Software
We present a proof repository that provides a uniform theorem proving interface to virtually any first-order theorem prover. Instead of taking the greatest common divisor of features supported by the first-order theorem provers, the design allows us to support any extension of the logic that can be expressed in first-order logic. If a theorem prover has native support for such a logic, this is ...
متن کامل